Confluence Problems for Trace Rewriting
نویسندگان
چکیده
منابع مشابه
Complexity Results for Confluence Problems
We study the complexity of the confluence problem for restricted kinds of semi–Thue systems, vector replacement systems and general trace rewriting systems. We prove that confluence for length– reducing semi–Thue systems is P–complete and that this complexity reduces to NC in the monadic case. For length–reducing vector replacement systems we prove that the confluence problem is PSPACE– complet...
متن کاملOn the Confluence of Trace Rewriting Systems
In [NO88], a particular trace monoid M is constructed such that for the class of length–reducing trace rewriting systems over M , confluence is undecidable. In this paper, we show that this result holds for every trace monoid, which is neither free nor free commutative. Furthermore we will present a new criterion for trace rewriting systems that implies decidability of confluence.
متن کاملOn the Theory of One-Step Rewriting in Trace Monoids
We prove that the first-order theory of the one-step rewriting relation associated with a trace rewriting system is decidable and give a nonelementary lower bound for the complexity. The decidability extends known results on semi-Thue systems but our proofs use new methods; these new methods yield the decidability of local properties expressed in first-order logic augmented by modulo-counting q...
متن کاملIwc 2013 2nd International Workshop on Confluence Program Committee Three Termination Problems Confluence and Infinity -a Kaleidoscopic View Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering (extended Abstract)
s of Invited Talks Three Termination Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Patrick Dehornoy Confluence and Infinity a kaleidoscopic view . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Jan Willem Klop
متن کامل